12.23 Abstractly, generalize the k-d heap so that only levels that branch on key #1 have two children (all others have one). a. Do we need links? b. Clearly, the basic algorithms still work; what are the new time bounds? - | |
| View Solution | |
| << Back | Next >> |